全文获取类型
收费全文 | 1146篇 |
免费 | 28篇 |
国内免费 | 60篇 |
专业分类
化学 | 30篇 |
力学 | 27篇 |
综合类 | 2篇 |
数学 | 1078篇 |
物理学 | 97篇 |
出版年
2024年 | 1篇 |
2023年 | 13篇 |
2022年 | 20篇 |
2021年 | 18篇 |
2020年 | 25篇 |
2019年 | 28篇 |
2018年 | 21篇 |
2017年 | 20篇 |
2016年 | 19篇 |
2015年 | 21篇 |
2014年 | 49篇 |
2013年 | 159篇 |
2012年 | 35篇 |
2011年 | 60篇 |
2010年 | 47篇 |
2009年 | 101篇 |
2008年 | 95篇 |
2007年 | 77篇 |
2006年 | 66篇 |
2005年 | 39篇 |
2004年 | 38篇 |
2003年 | 33篇 |
2002年 | 24篇 |
2001年 | 25篇 |
2000年 | 24篇 |
1999年 | 22篇 |
1998年 | 30篇 |
1997年 | 28篇 |
1996年 | 22篇 |
1995年 | 19篇 |
1994年 | 9篇 |
1993年 | 9篇 |
1992年 | 3篇 |
1991年 | 2篇 |
1990年 | 6篇 |
1989年 | 4篇 |
1987年 | 3篇 |
1986年 | 1篇 |
1985年 | 4篇 |
1984年 | 4篇 |
1983年 | 2篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 1篇 |
1979年 | 1篇 |
1976年 | 1篇 |
1974年 | 1篇 |
排序方式: 共有1234条查询结果,搜索用时 171 毫秒
21.
A Kakeya set contains a line in each direction. Dvir proved a lower bound on the size of any Kakeya set in a finite field using the polynomial method. We prove analogues of Dvir's result for non-degenerate conics, that is, parabolae and hyperbolae (but not ellipses which do not have a direction). We also study so-called conical Nikodym sets where a small variation of the proof provides a lower bound on their sizes. (Here ellipses are included.)Note that the bound on conical Kakeya sets has been known before, however, without an explicitly given constant which is included in our result and close to being best possible. 相似文献
22.
《Discrete Mathematics》2023,346(6):113349
The problem of reconstructing the characteristic polynomial of a graph of order at least 3 from the collection of characteristic polynomials of its vertex-deleted subgraphs was posed by Cvetkovi? in 1973 as a spectral counter part to the well-known Ulam's reconstruction conjecture. Over the last 50 years, this problem has received notable attention, many positive results have been obtained, but in the general case the problem is still unresolved. In particular, no counter example is found in literature. In this expository paper we survey classical and some more recent results concerning the polynomial reconstruction problem, discuss some related problems, variations and generalizations. 相似文献
23.
This paper is concerned with the mixed initial–boundary value problem for semilinear wave equations with complementary frictional dampings and memory effects. We successfully establish uniform exponential and polynomial decay rates for the solutions to this initial–boundary value problem under much weak conditions concerning memory effects. More specifically, we obtain the exponential and polynomial decay rates after removing the fundamental condition that the memory-effect region includes a part of the system boundary, while the condition is a necessity in the previous literature; moreover, for the polynomial decay rates we only assume minimal conditions on the memory kernel function g, without the usual assumption of controlled by g. 相似文献
24.
A new algorithm for computing all roots of polynomials with real coefficients is introduced. The principle behind the new algorithm is a fitting of the convolution of two subsequences onto a given polynomial coefficient sequence. This concept is used in the initial stage of the algorithm for a recursive slicing of a given polynomial into degree-2 subpolynomials from which initial root estimates are computed in closed form. This concept is further used in a post-fitting stage where the initial root estimates are refined to high numerical accuracy. A reduction of absolute root errors by a factor of 100 compared to the famous Companion matrix eigenvalue method based on the unsymmetric QR algorithm is not uncommon. Detailed computer experiments validate our claims. 相似文献
25.
26.
《Optimization》2012,61(3):597-624
Some scheduling problems induce a mixed graph coloring, i.e., an assignment of positive integers (colors) to vertices of a mixed graph such that, if two vertices are joined by an edge, then their colors have to be different, and if two vertices are joined by an arc, then the color of the startvertex has to be not greater than the color of the endvertex. We discuss some algorithms for coloring the vertices of a mixed graph with a small number t of colors and present computational results for calculating the chromatic number, i.e., the minimal possible value of such a t . We also study the chromatic polynomial of a mixed graph which may be used for calculating the number of feasible schedules. 相似文献
27.
飞机飞行中,测量剩余油量是关乎飞行安全的重要工作。以往采用的查表法存在存储数据量过大的问题,而插值法的计算又过于复杂,为此,提出了一种基于多项式数据拟合的油箱剩余油量测量方法,该方法通过存储多项式系数减少数据存储量,通过将多元插值计算改为多项式计算降低运算量。实验中,首先通过地面实验数据拟合获取多项式参数,再利用飞机飞行中获取的测量数据进行计算,所得结果与油箱内剩余油量的实际测量结果相比较,测量误差满足使用要求。通过理论和实验分析,在多项式拟合的阶数选择上明确了使用三阶多项式的合理性。该方法有较好的实用性,已在实践中应用。 相似文献
28.
In this paper we discuss bifurcation of critical periods in an m-th degree time-reversible system, which is a perturbation of an n-th degree homogeneous vector field with a rigidly isochronous center at the origin. We present period-bifurcation functions as integrals of analytic functions which depend on perturbation coefficients and reduce the problem of critical periods to finding zeros of a judging function. This procedure gives not only the number of critical periods bifurcating from the period annulus but also the location of these critical periods. Applying our procedure to the case n=m=2 we determine the maximum number of critical periods and their location; to the case n=m=3 we investigate the bifurcation of critical periods up to the first order in ε and obtain the expression of the second period-bifurcation function when the first one vanishes. 相似文献
29.
Marko D. Petkovi? Milan B. Tasi? Predrag S. Stanimirovi? 《Applied mathematics and computation》2011,217(19):7588-7598
We extend the algorithm for computing {1}, {1, 3}, {1, 4} inverses and their gradients from [11] to the set of multiple-variable rational and polynomial matrices. An improvement of this extension, appropriate to sparse polynomial matrices with relatively small number of nonzero coefficient matrices as well as in the case when the nonzero coefficient matrices are sparse, is introduced. For that purpose, we exploit two effective structures form [6], which make use of only nonzero addends in polynomial matrices, and define their partial derivatives. Symbolic computational package MATHEMATICA is used in the implementation. Several randomly generated test matrices are tested and the CPU times required by two used effective structures are compared and discussed. 相似文献
30.
Asymptotic properties of fractional delay differential equations 总被引:1,自引:0,他引:1
Katja Krol 《Applied mathematics and computation》2011,218(5):1515-1532
In this paper we study the asymptotic properties of d-dimensional linear fractional differential equations with time delay. We present necessary and sufficient conditions for asymptotic stability of equations of this type using the inverse Laplace transform method and prove polynomial decay of stable solutions. Two examples illustrate the obtained analytical results. 相似文献